Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2009, Vol. 32 ›› Issue (5): 61-65.doi: 10.13190/jbupt.200905.61.yangwd

• Papers • Previous Articles     Next Articles

A Novel Clustering Algorithm for Ad Hoc Network

YANG Wei-Dong   

  1. (Network Center, Southern Medical University, Guangzhou 510515, China)
  • Received:2009-01-08 Revised:2009-08-04 Online:2009-10-28 Published:2009-10-28
  • Contact: YANG Wei-Dong

Abstract:

Clustering is the most popular method to impose a hierarchical structure in the mobile Ad Hoc networks. However, the formation and maintenance of a hierarchical structure depends on certain clustering algorithm. By studying existing clustering algorithm, a new on-demand weighted clustering algorithm (NWBCA) is proposed. The optimized connectivity degree and energy status of mobile nodes are taken into consideration. The adoption of the on-demand strategy improves the stability of the network architecture and lowers the computing and communication cost. By investigating the performance of the proposed algorithm with that of others, the simulation indicates all the specifics of NWBCA are superior to those of the other and the validity of NWBCA has been proved.

Key words: Ad Hoc network, clustering algorithm, cluster and cluster header, optimized connectivity degree, state of energy, weight